Automated Selection of Appropriate Pheromone Representations in Ant Colony Optimisation
نویسندگان
چکیده
Ant Colony Optimisation (ACO) is a constructive metaheuristic that uses an analogue of ant trail pheromones to learn about good features of solutions. ACO implementations are typically tailored in an ad hoc manner to suit particular problems. Critically, the pheromone representation for a particular problem is usually chosen intuitively rather than by following any systematic process. In some representations, distinct solutions appear multiple times, increasing the effective size of the search space and potentially misleading ants as to the true learned value of those solutions. In this paper, we present a novel system for automatically generating appropriate parsimonious pheromone representations based on the characteristics of the problem model that ensures unique pheromone representation of solutions. This is the first stage in the development of a generalised ACO system that may be applied to a wide range of problems with little or no modification. However, the system we propose may be used in the development of any problem-specific ACO algorithm.
منابع مشابه
Solution bias in ant colony optimisation: Lessons for selecting pheromone models
Ant colony optimisation is a constructive metaheuristic in which solutions are built probabilistically influenced by the parameters of a pheromone model—an analogue of the trail pheromones used by real ants when foraging for food. Recent studies have uncovered the presence of biases in the solution construction process, the existence and nature of which depend on the characteristics of the prob...
متن کاملAutomated Selection of Appropriate Pheromone Representations in Ant Colony Optimization
Ant colony optimization (ACO) is a constructive metaheuristic that uses an analogue of ant trail pheromones to learn about good features of solutions. Critically, the pheromone representation for a particular problem is usually chosen intuitively rather than by following any systematic process. In some representations, distinct solutions appear multiple times, increasing the effective size of t...
متن کاملAutomated Parameterisation of a Metaheuristic for the Orienteering Problem
Developing metaheuristics requires in general a lot of work tuning different parameters. This paper presents a two–level algorithm to tackle this problem: an upper–level algorithm is used to determine the most appropriate set of parameters for a lower–level metaheuristic. This approach is applied to an Ant Colony Optimisation (ACO) metaheuristic that was designed to solve the Orienteering Probl...
متن کاملStructural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the operations to be scheduled. The combination of this representation and the use of a constructive algorithm introduces a bias typically favouring good solutions. When ant colony optimisation is applied to these proble...
متن کاملAnti-pheromone as a Tool for Better Exploration of Search Space
Many animals use chemical substances known as pheromones to induce behavioural changes in other members of the same species. The use of pheromones by ants in particular has lead to the development of a number of computational analogues of ant colony behaviour including Ant Colony Optimisation. Although many animals use a range of pheromones in their communication, ant algorithms have typically ...
متن کامل